| tech,9-1-C82-1054,ak | This paper proposes a series of modifications to the <term> left corner parsing algorithm </term> for <term> context-free grammars </term> . | #14087 This paper proposes a series of modifications to theleft corner parsing algorithm for context-free grammars. | |
| other,14-1-C82-1054,ak | This paper proposes a series of modifications to the <term> left corner parsing algorithm </term> for <term> context-free grammars </term> . | #14092 This paper proposes a series of modifications to the left corner parsing algorithm forcontext-free grammars. | |
| tech,6-2-C82-1054,ak | It is argued that the resulting <term> algorithm </term> is both efficient and flexible and is , therefore , a good choice for the <term> parser </term> used in a <term> natural language interface </term> . | #14101 It is argued that the resultingalgorithm is both efficient and flexible and is, therefore, a good choice for the parser used in a natural language interface. | |
| tech,22-2-C82-1054,ak | It is argued that the resulting <term> algorithm </term> is both efficient and flexible and is , therefore , a good choice for the <term> parser </term> used in a <term> natural language interface </term> . | #14117 It is argued that the resulting algorithm is both efficient and flexible and is, therefore, a good choice for theparser used in a natural language interface. | |
| tech,26-2-C82-1054,ak | It is argued that the resulting <term> algorithm </term> is both efficient and flexible and is , therefore , a good choice for the <term> parser </term> used in a <term> natural language interface </term> . | #14121 It is argued that the resulting algorithm is both efficient and flexible and is, therefore, a good choice for the parser used in anatural language interface. |
