E09-1069 demonstrated the effectiveness of deterministic parsing with default unification . The
E09-1069 parsing . First , we presented deterministic parsing for unification-based grammars
D15-1153 2011 ) . We unify below the five deterministic parsing models in Figure 1 . 3.1 Baseline
E09-1069 increased . The increase in LF for deterministic parsing without default unification ,
C90-1002 identical with ones produced by other deterministic parsing systems . 5.2 . Parsing Ungrammatical
E09-1069 achieved higher accuracy than deterministic parsing with normal unification . The
C80-1052 garden path sentences . Since deterministic parsing should model human performance
E09-1069 87.0 % , but is still worse than deterministic parsing with default unification . However
C88-2138 have multiple entries , and hence deterministic parsing would be no longer possible .
E09-1069 Therefore , in this study , we propose deterministic parsing for unification-based grammars
D15-1153 state-of-the-art accuracies , deterministic parsing is attractive for its high parsing
C04-1010 work on memory-based learning for deterministic parsing includes Veenstra and Daelemans
E09-1069 83.3 % . Table 1 also shows that deterministic parsing with default unification achieved
E09-1069 extension of the supertagger . The deterministic parsing can fail because of its grammar
C94-1074 syntax-based statistical approaches use deterministic parsing , derived from Marcus ' work
C90-1002 Our parser takes the approach of deterministic parsing and combines it with connectionism
C80-1052 be a major reinforcement of the deterministic parsing strategy . If it cannnot handle
E09-1069 for unification-based grammars . Deterministic parsing was difficult in the framework
D10-1120 designed by Michael Collins3 for deterministic parsing , shown in Table 3 . Unlike the
C80-1052 part-of-speech ambiguity . Is deterministic parsing still possible when part of speech
hide detail