• No results found

[PDF] Top 20 A model of syntactic disambiguation based on lexicalized grammars

Has 10000 "A model of syntactic disambiguation based on lexicalized grammars" found on our website. Below are the top 20 most common "A model of syntactic disambiguation based on lexicalized grammars".

A model of syntactic disambiguation based on lexicalized grammars

A model of syntactic disambiguation based on lexicalized grammars

... The parameters of the models were estimated by the limited-memory BFGS algorithm (Nocedal, 1980) with a Gaussian distribution as the prior probability distri- bution for smoothing (Chen and Rosenfeld, 1999) im- plemented ... See full document

8

Deriving lexical and syntactic expectation based measures for psycholinguistic modeling via incremental top down parsing

Deriving lexical and syntactic expectation based measures for psycholinguistic modeling via incremental top down parsing

... large-scale lexicalized grammars presents a problem for using an Earley parser to derive surprisal or for the calculation of entropy as Hale (2003; 2006) defines it, because both meth- ods require matrix ... See full document

10

Acquiring Compact Lexicalized Grammars from a Cleaner Treebank

Acquiring Compact Lexicalized Grammars from a Cleaner Treebank

... other lexicalized grammar formalisms, but because of the large number of categories, it is better to adopt a more fine-grained analysis of rare and unknown ... See full document

8

Neo Davidsonian Semantics in Lexicalized Grammars

Neo Davidsonian Semantics in Lexicalized Grammars

... The paper presents a method of integrating neo- Davidsonian event semantics within the formal frame- work of LFG. We showed how logical forms can be obtained from LFG rules augmented with logical an- notations. Further, ... See full document

7

Probabilistic Coordination Disambiguation in a Fully Lexicalized Japanese Parser

Probabilistic Coordination Disambiguation in a Fully Lexicalized Japanese Parser

... of syntactic and case structure (Kawahara and Kuro- hashi, 2006b), and “syn+case+coord” represents our proposed ...proposed model significantly outperformed both of the baseline systems (McNe- mar’s test; p ... See full document

9

Extraction of Tree Adjoining Grammars from a Treebank for Korean

Extraction of Tree Adjoining Grammars from a Treebank for Korean

... extracting grammars, especially for TAG formalism are ...extracted lexicalized grammars from English Penn Treebank and there are other works based on Chen’s procedure such as Johansen (2004) ... See full document

6

Syntactic Features for High Precision Word Sense Disambiguation

Syntactic Features for High Precision Word Sense Disambiguation

... Regarding syntactic information, in the Japanese tasks, several groups relied on dependency trees to extract features that were used by different models (SVM, Bayes, or vector space ...preferences based on ... See full document

7

A Fully Lexicalized Probabilistic Model for Japanese Syntactic and Case Structure Analysis

A Fully Lexicalized Probabilistic Model for Japanese Syntactic and Case Structure Analysis

... for analyzing function tags in Penn Treebank, and achieved a really high accuracy of 95.7% for syn- tactic roles, such as SBJ (subject) and DTV (da- tive) (Blaheta and Charniak, 2000). In recent years, there have been ... See full document

8

CCG Syntactic Reordering Models for Phrase based Machine Translation

CCG Syntactic Reordering Models for Phrase based Machine Translation

... Phrase- based systems build the result incrementally from the beginning of the target string to the end, and the intermediate strings need not constitute complete traditional syntactic ...recursive ... See full document

12

Lexicalized Markov Grammars for Sentence Compression

Lexicalized Markov Grammars for Sentence Compression

... system based on synchronous context-free grammars (SCFG), following the successful noisy-channel approach of (Knight and Marcu, ...train lexicalized models with much more data than previous ... See full document

8

Detecting and Correcting Syntactic Errors in Machine Translation Using Feature-Based Lexicalized Tree Adjoining Grammars

Detecting and Correcting Syntactic Errors in Machine Translation Using Feature-Based Lexicalized Tree Adjoining Grammars

... process, syntactic errors still ...feature-based lexicalized tree adjoining grammars, where each lexical item is associated with a syntactic elementary tree, in which each node is ... See full document

14

A Knowledge Based Approach to Syntactic Disambiguation of Biomedical Noun Compounds

A Knowledge Based Approach to Syntactic Disambiguation of Biomedical Noun Compounds

... dency model for NC bracketing based on frequencies of bi-grams in Grolier’s encyclopedia achieving 80% accuracy on a dataset of 3-token NCs extracted from the ... See full document

10

Joint Morphological and Syntactic Disambiguation

Joint Morphological and Syntactic Disambiguation

... parse tree, because of errors made by the speech recognizer. The metric is based on an alignment between the hypothesized sentence and the gold- standard sentence. We used a similar evaluation metric, which takes ... See full document

10

The Use of Prosody in Syntactic Disambiguation

The Use of Prosody in Syntactic Disambiguation

... THE USE OF PROSODY IN SYNTACTIC DISAMBIGUATION THE USE OF P R O S O D Y IN SYNTACTIC DISAMBIGUATION Patti Price (SRI), Mari Ostendorf (BU), Stefanie Shattuck Hufnagel (MIT), Cynthia Fong (BU) SRI Inte[.] ... See full document

6

Resources for Lexicalized Tree Adjoining Grammars and XML Encoding: TagML

Resources for Lexicalized Tree Adjoining Grammars and XML Encoding: TagML

... are based on the TAG (Tree Adjoining Grammar) formalism (Joshi et ...the grammars which would facilitate the ex- change of TAG grammars and associated data, as well as for developing normalised ... See full document

8

Some Novel Applications of Explanation Based Learning to Parsing Lexicalized Tree Adjoining Grammars

Some Novel Applications of Explanation Based Learning to Parsing Lexicalized Tree Adjoining Grammars

... So if there is an auxiliary tree that is used in an LTAG parse, then that tree with the trees for its arguments can be repeated any number of times, or possibly omitted altogether, to ge[r] ... See full document

8

Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy

Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy

... Abstract This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an I_TAG lexicon as an inheritance hierarchy with internal l[r] ... See full document

8

Book Reviews: Grammaires d’unification a traits et conto1e des infinitives en francais

Book Reviews: Grammaires d’unification a traits et conto1e des infinitives en francais

... B6s, makes it possible to have in French a very useful reference work for syntactic systems based on generalized phrase-structure grammars GPSGs and unification categorial grammars UCGs,[r] ... See full document

5

Use of Prosody in Syntactic Disambiguation: An Analysis by Synthesis Approach

Use of Prosody in Syntactic Disambiguation: An Analysis by Synthesis Approach

... USE OF PROSODY IN SYNTACTIC DISAMBIGUATION AN ANALYSIS BY SYNTHESIS APPROACH USE O F PROSODY IN SYNTACTIC DISAMBIGUATION A N ANALYSIS BY SYNTHESIS APPROACH C W Wightman, N M Veilleuz, M Ostendorf Bost[.] ... See full document

6

A structure sharing parser for lexicalized grammars

A structure sharing parser for lexicalized grammars

... A structure sharing parser for lexicalized grammars A s t r u c t u r e s h a r i n g parser for l e x i c a l i z e d g r a m m a r s R o g e r E v a n s I n f o r m a t i o n T e c h n o l o g y R e[.] ... See full document

7

Show all 10000 documents...