| E95-1038 | in probabilistic techniques for | automatic language analysis | . In particular , there has arisen |
| C04-1088 | less clear , though , whether an | automatic language analysis | system can be reliable enough |
| D12-1004 | Recent studies have shown that | automatic language analysis | can be successfully applied to |
| J09-1008 | is the ultimate criterion for | automatic language analysis | . To draw an analogy with another |
| H93-1060 | of English words , intended for | automatic language analysis | . We are initially aiming for |
| C69-6212 | been focused on two facts : I. | Automatic language analysis | discovers structural homon ~ |
| P13-4012 | chatterbot system . Advances in | automatic language analysis | and processing are used as the |
| E09-2014 | language technologies to approach | automatic language analysis | and generation from yet another |
| J88-1003 | bearing in mind that any fully | automatic language analysis | system has to come to terms with |
| W03-2409 | is the ultimate criterion for | automatic language analysis | . To draw an analogy with another |
| C69-0401 | way to test the effectiveness of | automatic language analysis | and indexing methods in information |
| C69-0401 | experiments : a ) the simplest | automatic language analysis | procedure consisting of the assignment |
