a widecoverage ccg parser

Ngày tải lên: 31/03/2014, 06:20

... merging all the final states into one. The parser maintains a dynamic record of which trees are valid for states (in particular fi- nal states) in the parse table. This means that we can minimise ... the optimisation process and a possible parsing algorithm that makes use of it 1 . 2 Automaton-based parsing Conventional LTAG parsers (Vijay-Shanker and Joshi, 1985; Schabes and Joshi, ... the main spine. The automata for both the primary and secondary anchors associated with a lexical item could then be merged, minimized and used for parsing as above. Using automata for parsing...

Ngày tải lên: 20/02/2014, 18:20

... in Annals of Mathe- matics and Artificial Intelligence, 1993. [3] David E. Johnson and Paul M. Postal. Are Pair Grammar. Princeton University Press, 1980. [4] Ronald Kaplan and Joan Bresnan. ... suitable for building computational relational grammars. A lexicalized SFG is sim- ply a collection of stratified feature graphs (S- graphs), each of which is anchored to a lexical item, analogous ... demonstrated that even RG's multiple strata are amenable to a feature-structure treat- ment. Based on this work, we have developed a unification-based, chart parser for a lexical ver- sion...

Ngày tải lên: 20/02/2014, 21:20

... expand out each of the three cases: (1 3a) homorganic-nasal-cluster ~ labial-nasal labial-obstruent (13b) homorganie-nasal-cluster ~ coronal-nasal coronal-obstruent (13c) homorganic-nasal-cluster ... constraint. Nasal-cluster and place-assimilation are defined as: (1 7a) (setq nasal-cluster-lattice (M. nasal-lattice obstruent-lattice)) (17b) (setq place-assimilation-lattice (M + (M** labial-lattice) ... assimilation. In my language of matrix operations, I can say just exactly that: (16) (setq homorganic-na~l-cluster-lattice (M& nasal-cluster-lattice place-assimilation)) where M&...

Ngày tải lên: 21/02/2014, 20:20

... empirical ac- curacy that can be obtained with transition-based 2-planar parsing, we have evaluated the parser on four data sets from the CoNLL-X shared task (Buchholz and Marsi, 2006): Czech, Danish, ... European Chapter of the Association for Computational Linguistics (EACL), pages 291– 299. Jan Haji ˇ c, Otakar Smr ˇ z, Petr Zem ´ anek, Jan ˇ Snaidauf, and Emanuel Be ˇ ska. 2004. Prague Arabic ... Computational Nat- ural Language Learning (CoNLL-2004), pages 49– 56, Morristown, NJ, USA. Association for Compu- tational Linguistics. Joakim Nivre, Johan Hall, and Jens Nilsson. 200 6a. MaltParser:...

Ngày tải lên: 07/03/2014, 22:20

... relationship between 'sales' and the three tokens of 'of': Example 2 Shaw, based in Dalton, Ga., has an- nual sales of about $1.18 billion, and has economies of scale and ... Generalized LR Parsing of Natural Language (Corpora) with Unification-Based Grammars. Computa- tional Linguistics, 19(1):25-60. K. Church. 1988. A Stochastic Parts Program and Noun Phrase Parser ... more than 2 'commas' be- tween the hith word and the jth word? (All symbols tagged as a ',' or ':' are considered to be 'commas'). • Is there a 'comma'...

Ngày tải lên: 08/03/2014, 07:20

... Prentice-Hall (1973) Kaplan,R. & Bresnan~I. Lexical-Functional Grammar: a formal system for grammatical representation. In Bresnan,J., Ed. The Mental Representation of Grammatical Relations. ... component and its weight (for instance the new alternative may be a partial NP instead of a complete NP (as in take care), or a NP marked differently from usual). The latter specifies that a certain ... Idiomatic Expressions. Journal of Verbal Learning and Verbal Beh~viour, 18, 523-534(1978) Waltz, D. An English Language Question Answering System for a Large Relational Database. Communications...

Ngày tải lên: 08/03/2014, 18:20

Ngày tải lên: 17/03/2014, 02:20

Ngày tải lên: 17/03/2014, 04:20

Ngày tải lên: 23/03/2014, 16:21

Ngày tải lên: 23/03/2014, 18:20

Ngày tải lên: 30/03/2014, 23:20

Ngày tải lên: 31/03/2014, 17:20

Ngày tải lên: 17/03/2014, 09:20

... 2004. A maximum-entropy Chinese parser augmented by transformation-based learning. ACM Transactions on Asian Language Information Processing, 3(2):159–168. Mary Hearne and Andy Way. 2004. Data-oriented parsing ... times faster than Levy and Manning’s parser, and 270 times faster than Bikel’s parser. Another advan- tage of our parser is that it does not take as much memory as these other parsers do. In fact, ... the stack into one IP node, and outputs this as a partial parse. Sagae and Lavie (2005) have shown that this algorithm has linear time complexity, assuming that classifica- tion takes constant time....

Ngày tải lên: 20/02/2014, 12:20

... efficient than a bidirectional or non-directional approach. Lastly, the grammar is head-driven, and we would thus expect the most appropriate parsing algorithm to take advantage of the information ... Bach's (1979) wrapping oper- ations, Pollard's (1984) head-wrapping operations, and Moortgat's (1996) extraction and infixation op- erations in (categorial) type-logical grammar. ... ConTroll also allows a parsing strategy to be specified within the same formalism as the grammar. 3 Our imple- mentation of the head-corner parser adapts van No- ord's (1997) parser to...

Ngày tải lên: 20/02/2014, 18:20

... Categorial Grammar, Lexi- cal Functional Grammar, and Head-driven Phrase Structure Grammar. An SUG grammar is a set of partial descrip- tions of phrase structure trees. Each SUG gram- mar ... In Lawrence Davis, editor, Genetic Algorithms and Simulated Annealing, chapter 11, pages 141- 154. Morgan Kaufmann Publishers, Los Altos, CA. Shastri, Lokendra and Ajjanagadde, Venkat (1990). ... The grammars which are supported by the parser are a subset of those for Structure Unification Grammar. These grammars are for the most part lexicalized. Each lexicalized grammar entry is a rooted...

Ngày tải lên: 20/02/2014, 21:20

... artifical example grammar: A *Aa :A( a) A~ a ;a When processing a string 'aaa ', the parser operates as in the following trace ('b' is the interpretation of &apos ;a& apos;): ... grammars have some status, independently of parsers, as mental objects. That is to say, it was assumed that what linguists say about natural language in the form of a gram- mar {including semantic ... driving mechanism of the parser- interpreter maintains an agenda of configurations, each representing a particular state of a pars,,. A configuration is a pair consisting of a representation of...

Ngày tải lên: 22/02/2014, 09:20

... of a particular set of constituents or word- 166 appear). Francis, W.N. and Kucera, H. (1964), "Manual of Information to Accompany a Standard Sample of Present-Day Edited American English, ... A PROBABILISTIC PARSER Roger Garside and Fanny Leech Unit for Computer Research on the English Language University of Lancaster Bailrigg Lancaster LAI 4YT, U.K. ABSTRACT The UCREL team ... T-tags to an entry, they are given in approximately decreasing likelihood and rare T-tags are marked as such. The treebank of manually parsed sentences can now be used to extract information...

Ngày tải lên: 22/02/2014, 09:20

... in a compact way. We also compile each grammar rule into a finite state automaton. Each rule automaton can be regarded as a constraint that accepts some readings and rejects some. For example, ... preposition APP Apposition @> ;A QA< AD -A, head follows AD -A, head precedes 397 Ambiguity resolution in a reductionistic parser * Atro Voutilainen & Pasi Tapanainen Research Unit ... regarded as a roundabout partial statement about the form of a noun phrase: a determiner is fol- lowed by a premodifier or a noun phrase head, so all morphological readings that cannot act as...

Ngày tải lên: 22/02/2014, 10:20