[PDF] Top 20 A Grammar Formalism and Parser for Linearization based HPSG
Has 10000 "A Grammar Formalism and Parser for Linearization based HPSG" found on our website. Below are the top 20 most common "A Grammar Formalism and Parser for Linearization based HPSG".
A Grammar Formalism and Parser for Linearization based HPSG
... LSL grammar format as defined by Suhre (1999) (based on G¨otz and Penn, 1997) allows el- ements to be ordered in domains that are larger than a local tree; as a result, categories are not re- quired to ... See full document
7
Japanese Parser on the basis of the Lexical-Functional Grammar Formalism and its Evaluation
... ... See full document
12
Robust, Finite State Parsing for Spoken Language Understanding
... Aside from infinite center-self-embedding, a regular grammar formalism like PROFER's can be used to define every pattern in natural language definable by a GLR parser... Figure 4: Finite[r] ... See full document
6
Partial Training for a Lexicalized Grammar Parser
... attempted parser adaptation without relying on treebank data from the new do- main (Steedman et ...lexicalized grammar formalisms. The formalism we use is Combinatory Categorial Grammar ... See full document
8
A Learnable Constraint based Grammar Formalism
... Well-Founded Grammar (LWFG) is a recently developed syntactic- semantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability ...and ... See full document
9
An HPSG based Shared Grammar for the Chinese Languages: ZHONG [|]
... ZHONG [ ] includes an unknown word handling module based on the chart-mapping technique of Adolphs et al. (2008). We have built a pipeline for converting raw text into a segmented POS-based lattice for ... See full document
8
Robust Parsing with a Large HPSG Grammar
... modified parser starts parsing with HPSG rules and TFS unification as ...PET parser uses subsumption-based ambiguity packing to effectively repre- sent the local ...equivalence- based ... See full document
6
Construction of an HPSG Grammar for the Arabic Relative Sentences
... is based on the use of a large number of production and dy- namic rules because the HPSG used version is ...on HPSG to adapt it to coordination. Note that all these works are based on their ... See full document
6
Formalism Independent Parser Evaluation with CCG and DepBank
... The grammar used by the parser is extracted from CCGbank, a CCG version of the Penn Treebank (Hockenmaier, ...the parser using the combi- natory rules and the CKY ...derivations based on the ... See full document
8
Building an HPSG based Indonesian Resource Grammar (INDRA)
... for grammar development provided by DELPH-IN: Linguistic Knowledge Builder (LKB) (Copestake, 2002), a grammar and lexicon de- velopment environment for typed feature struc- ture grammars; The LinGO ... See full document
8
Transfer Learning for Constituency Based Grammars
... crafted rules (Hockenmaier and Steedman, 2002; Miyao et al., 2005). Table 3 shows which sec- tions of the treebanks were used in training, test- ing and development for both formalisms. Our LFG training dataset was ... See full document
11
Adapting a Probabilistic Disambiguation Model of an HPSG Parser to a New Domain
... Our disambiguation model is a log-linear model into which the original disam- biguation model is incorporated as a reference distribution. However, we cannot simply estimate this model, because of the problem that has ... See full document
12
Exploring HPSG-based Treebanks for Probabilistic Parsing HPSG grammar extraction
... We performed a ten–fold cross–validation over a corpus of 3528 sentences from the Verbmobil domain with an average sentence length of 7.2 words. The anchors of the extracted supertags consist of the preterminals of the ... See full document
6
Dependency Grammar Induction with a Neural Variational Transition-Based Parser
... model outperforms RF on both WSJ-10 and full WSJ, achieving a new state of the art for transition-based de- pendency grammar induction. The RF model does not use universal rules, but its linguistic ... See full document
8
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
EUSP: An Easy to Use Semantic Parsing PlatForm
... the grammar rule Entity- Function ∧ AttributePredicate → AttributeValue- Function means ‘AttributeValueFunction’ can be composed by ‘EntityFunction’ and ‘AttributePred- ...the grammar rules are pre-defined, ... See full document
6
HPSG Style Underspecified Japanese Grammar with Wide Coverage
... HPSG Style Underspecified Japanese Grammar with Wide Coverage HPSG Style Underspecified Japanese Grammar with Wide Coverage M I T S U I S H I Y u t a k a t, T O R I S A W A K e n t a r o t, T S U J I[.] ... See full document
5
Modular parsers
... A token is an atomic piece of a grammar, usually representing a short text string. Typical tokens might include reserved words, identifiers, numbers etc. A single token is usually able to represent a large set of ... See full document
11
An HPSG Parser Based on Description Logics
... An HPSG Parser Based on Description Logics A n H P S G P a r s e r B a s e d o n D e s c r i p t i o n l , o g i e s * J Joachim Quantz Technische Universit~it Berlin, ]'rojekt KHZVM11, FR 5 d 2, Fran[.] ... See full document
5
Object clitics and clitic climbing in Italian HPSG grammar
... This approach can he extended to clitics in order to account for the clitic climbing cases producing an analysis which captures intuitions similar to the ones underlying a restructuring [r] ... See full document
6
Related subjects