extended finite state approach

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

... 2004 Research Award at the Ohio State University. We acknowledge support from NSF grant IIS 0347799. References S. Bangalore and A. K. Joshi. Supertagging: an approach to almost parsing. Computational ... the work is neither a mere extended application of Corley and Crocker’s work to a broader range of data, nor does it simply con- firm earlier observations that finite state machines might accurately ... data used and the interpretation of the model for human sentence processing. Corley and Crocker clearly state that their model is strictly limited to lexical ambiguity resolution, and their test of the...

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

... recognition vocabulary of 16716 words; • 3 -state- HMM topology with skip; • 2500 decision tree based generalized within- word triphone states including noise plus one state for silence; • 237k gender independent ... N- best rescoring approach. In this paper, we study different methods for integrating MT models to ASR word graphs instead of N-best list. We consider ASR word graphs as finite -state automata (FSA), ... Association for Computational Linguistics Integration of Speech to Computer-Assisted Translation Using Finite- State Automata Shahram Khadivi Richard Zens Lehrstuhl f ¨ ur Informatik 6 – Computer Science...

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

... models with finite state supervision. In A. Kornai, ed., Extended Finite State Models of Language. Cambridge University Press. Emmanuel Roche and Yves Schabes, editors. 1997. Finite- State Language ... semirings: Flexible EM for finite -state transducers. In G. van Noord, ed., Proc. of the ESSLLI Workshop on Finite- State Methods in Natural Language Processing. Extended abstract. Jason Eisner. ... de- velopment cycle in natural language engineering. 2 Transducers and Parameters Finite- state machines, including finite -state au- tomata (FSAs) and transducers (FSTs), are a kind of labeled directed...

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

... ed- it distance from state 0 to state j, and the cost(i,j) is the cost of insertion, deletion or substitution from s- tate j to state i. The equation means the minED of state i can be computed ... of state i can be computed by the accumulated minED- cost of state j in the phase p. The state j belongs to the have-been-calculated state set {X 0 ,. . . ,X p−1 } in phase p. In phrase p, we compute ... our FST methods will be evaluated on the corpus we men- tioned above. The contrasting approach, the LSA- SVR approach, will also be presented. 5.1 Data Setup The experiment corpus consists of 417...

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

... awra. As the figure depicts, 0 is the start state and 4 is the final state. Each transition is a 4-tuple <c, n, i, o> where c is current state, n is the next state, i is the input symbol and o is ... FST transition table do 3: if next state is a final state then 4: for all rules where I is the last character of first word do 5: S = next state from the start state on encountering X; 6: Y = first ... Segmentation Approaches. ECTI-CON, Krabi. Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wo- jciech Skut, and Mehryar Mohri. 2007. OpenFst: A General and Efficient Weighted Finite- State Trans- ducer...

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

... model-specific code. Once this unscored translation forest has been generated, any non-coaccessible states (i.e., states that are not reachable from the goal node) are re- moved and the resulting structure ... models. In Proc. ACL. L. Huang, K. Knight, and A. Joshi. 2006. A syntax-directed translator with extended domain of locality. In Proc. of AMTA. P. Koehn, F. J. Och, and D. Marcu. 2003. Statistical ... enabling the parameterization of the model using millions of sparse features. While this training approach was originally proposed for SCFG-based transla- tion models, it can be used to train any...

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

... quence of a start state, reading states, a crossover state, prefinal states, and a final state. The excep- tion to this is a path accepting the empty string, which has a start state, possibly ... reading states), states with e-transitions entering and leaving them (prefinal states), and states with terminal transitions entering them and e-transitions leaving them (cr0ssover states). ... sequence of G-transitions leading to the final state [$' * S.]. Hence ~" has the following kinds of states: the start state, the final state, states with terminal transitions entering...

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

... q0, R) where (1) Q is a finite set of states, (2) ~ is an input ranked alphabet, (3) A is an output alphabet, (4) q0 E Q is the initial state, and (5) R is a finite set of rules of ... 1969) takes a tree as an input, starts from the initial state with its head scanning the root node of an input. Ac- cording to the current state and the label of the scanned node, it transforms ... of the scanned node, it transforms an input tree into an output tree in a top-down way. A finite state translation system (fts) is a tree transducer with its input domain being the set of...

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

... have chosen to represent rules as subse- quential finite state transducers. Subsequential finite state transducers are a subtype of finite state transduc- ers with the following properties: ... destination state After the process of merging states terminates, a deci- sion tree is induced at each state to classify the outgoing arcs. Figure 9 shows a tree induced at the initial state of ... Destination State: 0 2: Output: [ ], Destination State: 1 prim-stress ix+ 1 2 On end of string: Output: nil, Destination State: 0 Figure 9: Decision Tree Before Pruning: The initial state of...

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

... languages can be assigned to them by finite- state parsers that op- erate by identifying constituents as quickly as possible. We call this the Efficient Finite- State Parser Hypothesis. The four ... eds., New Approaches to Language Mechanisms. Amsterdam: North-Holland. Jackendoff, Ray S. (1977) X-Bar Syntax. Cam- bridge, Mass.: MIT Press. Langendoen, D. Terence (1975) Finite- state par- ... acceptable sentences of a na- tural language in a manner which enables them to be parsed by a finite- state device, and which also predicts the way in which (at least) certain ex- pressions with...

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

... parser for spontaneous speech that is at once both robust and finite- state. It is called PROFER, for Predictive, RO- bust, Finite- state parsER. Currently PROFER accepts a transcript as input. ... removed. Each initial state of a sub-net is assumed into its par- ent state which is equivalent to item-set for- mation in that parent state (Figure 7 left-side). Each final state of a sub-net ... begins the FSM always starts at state 0:0 (i.e., net 0, start state 0) and tra- verses an arc labeled by the top-level net name to the 0:1 state (i.e., net 0, final state 1), as il- lustrated...

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

... into purely statistical approaches (Sproat and Shih, 1990), statistical approaches which incorporate lexical knowledge (Fan and Tsai, 1988; Lin et al., 1993), and approaches that include lexical ... methods incorporated into a uniform stochastic finite- state model. We believe that the ap- proach reported here compares favorably with other reported approaches, though obviously it is impossible ... Foreign Names: ~i~::,,~ bu4- lang 3-shi4-wei2-ke4 'Brunswick'. We present a stochastic finite- state model for seg- menting Chinese text into dictionary entries and words derived via the...

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

... Stuttgart mike@adler.ims.uni - stuttgart.de Abstract The paper presents two approaches to partial parsing of German: a tagger trained on dependency tuples, and a cas- caded finite- state parser (Abney, 1997). For the tagging approach, the effects ... resolved by expert disam- biguation modules. The performance of the finite- state parser has been compared with a very simple tagging approach which nevertheless gets more than 50% of the dependency ... Results Currently, the speed of the finite- state parser is at 2430 Words Per Second, but this figure can still be improved by compiling the backtracking necessi- tated in Abney's (1997) approach into the...

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

... third approach makes use of a finite set of registers that the FST can write to and read from (Cohen-Sygal and Wintner, 2006). Because it can remember relevant previous states, a “finite -state registered ... Sound Pattern of English. Harper and Row, New York. Yael Cohen-Sygal and Shuly Wintner. 2006. Finite- state registered automata for non-concatenative mor- phology. Computational Linguistics, 32:49–82. Ann ... in the next section). Researchers within the finite state framework have proposed a number of ways to deal with Semitic template morphology. One approach is to make use of separate tapes for root...

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

... Roche, E. 1996. Parsing with Finite- State Trans- ducers, http://www.merl-com/reports/TR96- 30. Visited 12/03/99. Roche, E. and Schabes, Y., editors, 1997. Finite- State Language Processing, ... The regular expressions are translated into finite- state automata, and the union of the automata yields a single, determin- istic, finite- state, level recognizer, (Abney, 1996). Moreover, ... mentation on a small scale of finite- state meth- ods for noun phrases only, (Cooper, 1984; Rauch, 1993). However, large scale grammars for Swedish do exist, employing other approaches to parsing,...

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

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

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

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

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