• No results found

[PDF] Top 20 A Grammar and a Parser for Spontaneous Speech

Has 10000 "A Grammar and a Parser for Spontaneous Speech" found on our website. Below are the top 20 most common "A Grammar and a Parser for Spontaneous Speech".

A Grammar and a Parser for Spontaneous Speech

A Grammar and a Parser for Spontaneous Speech

... A GRAMMAR AND A PARSER FOR SPONTANEOUS SPEECH A G R A M M A R A N D A P A R S E R F O R S P O N T A N E O U S S P E E C H Mikio Nakano, Akira Shimazu, and Kiyoshi Kogure NTT Basic Research Laboratorie[.] ... See full document

7

Combining Language Resources Into A Grammar-Driven Swedish Parser

Combining Language Resources Into A Grammar-Driven Swedish Parser

... of grammar- based parsers, although none is freely ...state parser CassSwe (Kokkinakis and Kokki- nakis, 1999) and The Swedish Constraint Grammar (Birn, 1998) give syntactic ...Dependency ... See full document

6

Adapting a Lexicalized Grammar Parser to Contrasting Domains

Adapting a Lexicalized Grammar Parser to Contrasting Domains

... model was responsible for most of the improvement in parsing for the biomedical domain, while the new supertagger model was necessary to see a large im- provement in the question domain. We attribute this to the fact ... See full document

10

FrAG, a Hybrid Constraint Grammar Parser for French

FrAG, a Hybrid Constraint Grammar Parser for French

... In an earlier evaluation of a more immature version of the system (October 2003) - without a module to add lexical alternatives to DTT-readings – another, larger test run was performed against a newspaper benchmark text ... See full document

5

A Hybrid Japanese Parser with Hand crafted Grammar and Statistics

A Hybrid Japanese Parser with Hand crafted Grammar and Statistics

... This paper describes a hybrid parsing method for Japanese which uses both a hand-crafted gram- mar and a statistical technique. The key feature of our system is that in order to estimate likeli- hood for a parse tree, ... See full document

7

Parser Adaptation and Projection with Quasi Synchronous Grammar Features

Parser Adaptation and Projection with Quasi Synchronous Grammar Features

... a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ...synchronous grammar (QG) features for these structured learning ...chronous ... See full document

10

Pruning the Search Space of the Wolof LFG Grammar Using a Probabilistic and a Constraint Grammar Parser

Pruning the Search Space of the Wolof LFG Grammar Using a Probabilistic and a Constraint Grammar Parser

... Wolof grammar so that it can deal with the for- mat of the sentences in the gold standard ...the grammar rules are rewritten to integrate the brackets LSB (left square bracket) and RSB (right square ... See full document

8

A Grammar Formalism and Parser for Linearization based HPSG

A Grammar Formalism and Parser for Linearization based HPSG

... a grammar for- mat that can be used as a processing backbone for linearization-based HPSG grammars that supports the specification of discontinuous constituents and word order constraints on domains that extend ... See full document

7

Building a Constraint Grammar Parser for Plains Cree Verbs and Arguments

Building a Constraint Grammar Parser for Plains Cree Verbs and Arguments

... Though an admittedly rather archaic technology, the CG formalism offers several advantages for modelling the syntax of languages such as Plains Cree. One, the rich agreement morphology of Plains Cree lends itself readily ... See full document

8

Testing a Minimalist Grammar Parser on Italian Relative Clause Asymmetries

Testing a Minimalist Grammar Parser on Italian Relative Clause Asymmetries

... top-down parser for Minimalist grammars (MGs; Stabler, 1996, 2013)) can be combined with complexity metrics to relate parsing behavior to memory usage, and successfully used to model sentence processing ... See full document

12

Dependency Grammar Induction with a Neural Variational Transition-Based Parser

Dependency Grammar Induction with a Neural Variational Transition-Based Parser

... Dependency grammar induction is the task of learning de- pendency syntax without annotated training ...transition-based parser for dependency grammar induction, whose inference proce- dure utilizes ... See full document

8

A Syntax Parser Based on the Case Dependency Grammar and Its Efficiency

A Syntax Parser Based on the Case Dependency Grammar and Its Efficiency

... A SYNTAX PARSER BASED ON THE CASE DEPENDENCY GRAMMAR AND ITS EFFICIENCY A SYNTAX PARSER BASED ON THE CASE DEPENDENCY GRAMMAR AND ITS EFFICIENCY Toru Hitaka and Sho Yoshida Department of Electronics, K[.] ... See full document

6

Partial Training for a Lexicalized Grammar Parser

Partial Training for a Lexicalized Grammar Parser

... attempted parser adaptation without relying on treebank data from the new do- main (Steedman et ...Categorial Grammar (Steedman, 2000), together with a parsing model described in Clark and Curran (2004b) ... See full document

8

A Connectionist Parser for Structure Unification Grammar

A Connectionist Parser for Structure Unification Grammar

... Such grammar entries specify what information is known about the phrase structure of the sentence given the presence of the word, and can be used Henderson, 1990 to simulate Lexicalized [r] ... See full document

8

A Unification Based Parser for Relational Grammar

A Unification Based Parser for Relational Grammar

... 1 For instance, in Joe gave Mary tea there are, at the clause level, four sister arcs arcs with the same source node, as shown in Figure h one arc labeled [HI with target gave, indicatin[r] ... See full document

8

Categorial Grammar with Features and the Parser on Web pages

Categorial Grammar with Features and the Parser on Web pages

8

Creating a Grammar-Based Speech Recognition Parser for Mexican Spanish Using HTK, Compatible with CMU Sphinx-III System

Creating a Grammar-Based Speech Recognition Parser for Mexican Spanish Using HTK, Compatible with CMU Sphinx-III System

... automatic speech recognition based on HTK but compatible with the CMU Sphinx-III speech recognition ...Japanese speech recognition system called Julius for live ... See full document

5

Evaluation of Two Bengali Dependency Parsers

Evaluation of Two Bengali Dependency Parsers

... Malt Parser is retrained on this data but the grammar driven parser was not ...Malt Parser with default properties where final accuracy is achieved after optimization of Malt ... See full document

10

Modular parsers

Modular parsers

... There are some circumstances, however, where it is desirable to construct a parser from grammar fragments rather than from a complete grammar. Whilst there are complex dependencies between fragments, ... See full document

11

Detecting Dependency Parse Errors with Minimal Resources

Detecting Dependency Parse Errors with Minimal Resources

... Looking at the results for the parser trained on section 00, there are 252,700 errors (26.6%) in over 950,000 words. By using the high-gram method and a grammar extracted from the gold data for section 00, ... See full document

12

Show all 10000 documents...