Báo cáo khoa học: "Parsing with Discontinuous Constituents" pot

... location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous consti- tuents of non-configurational languages. These discontinuous consti- tuents can be described ... languages is described by allowing constituents to have discontinuous [ocatio,ls. To demonstrate that it is possible to parse with such discontinuous constituents. I show how th...

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

... derivation tree itself. It as- sumes that binary trees (with parent category ) have one head child (with category ) and one non- head child (with category ), and that each node has one lexical head . ... projection of constituents. After expanding the node to and , the NP that is co-indexed with woman can- not be unified with the object of saw anymore. These examples have shown that two...

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

... since the same rule may be used several times within a single derivation, and also the same constituent may be used within different partial analyses with features instantiated in dif- ferent ... addressed both with respect to grammar encoding (Evans et al., 1995; Candito, 1996) and parsing (Joshi and Srinivas, 1994; Evans and Weir, 1998). On the other hand, if the EDOL hypothesis...

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

... and with either the same path or with path p. Also, in leaves of a proof in L (/'\'v), categories only occur with zero path. Therefore, if we have 124 a proof of a sequent with ... positive occurrence of ViX.X/X and with non-zero path, then there must occur higher in the proof, a sequent with V,.X.X/X occurring again positively and this time with with zero-path...

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

... signature and a span . If we align the tags in with words in and align the categories in with spans of words in , then pro- vided the categories align with a non-empty span (for NOEMPTIES) or any ... that all states with the same signature will match a span length with the same probability. For example, the state NP NP NP CC . NP has the same signature, but must align the CC with...

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

... the Binomial Hypothesis Test (Brent, 1993) and a back-off algorithm (Sarkar and Zeman, 2000). 1. The Binomial Hypothesis Test (BHT): Let p be the probability that an scf i occurs with verb j that ... usually proceed in two steps and we adopt this approach. 1. Hypothesis Generation: Identify all SCCs from the corpus data. 2. Hypothesis Selection: Determine which SCC is a valid SCF for a part...

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

... notation for a cate- gory c paired with its (partial) syntax tree t is c : t. A basic category is associated with the tree con- sisting of one node labelled with the name of the category. Complex ... applications, i.e. one distinguished leaf is labelled with the functor category which this tree is associa- ted with, all other leaves are labelled with variables bound by A-op...

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

... attachment" (MA) are often formulated with respect to constituent trees. We present 3 preference principles based on "derivation trees" within the framework of LTAGs. We argue ... substitution with an initial tree that has a root of same category. Adjunction is optional (although it can be forbidden or made compulsory using specific constraints) and deals essential...

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

... than the overall figure. We have also experimented with using automat- ically assigned POS tags. These tags are accurate with an F-score of 96.34%, with precision 96.20% and recall 96.49%. Table ... to deal with. We may also need to change dependencies reaching from inside to outside the NP, if the head(s) of the NP have changed. In these cases we simply replace the old head(s) with...

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

... grammar with the par- tial bracketings of these sentences given in the corpus. Using part-of-speech tags as the only source of lexical information, high bracketing accuracy is achieved even with ... algorithm on a gr,-unmar with n nontermi- nals requires O(n31wl 3) time per t~ning sentence w. Sec- ond, the inferred grammar imposes bracketings which do not agree with linguisti...

Ngày tải lên: 01/04/2014, 00:20