| A92-1033 | relationships is currently based on | exact matching | . The matching process is being |
| D12-1011 | between a symbol s and text t , | exact matching | and partial matching . Exact |
| D11-1070 | length of 1,2 or 3 ( and we used | exact matching | after lemmatisation ) . There |
| C94-2114 | 1 . Searching for examples 2 . | Exact matching | 3 . Best matching with a thesaurus |
| C92-2104 | with the part of structure 2 . | Exact matching | makes matching only once . while |
| C92-2104 | same as W5 , the system performs | exact matching | between database ( W3 ) and database |
| C92-2104 | same as W7 , the system performs | exact matching | between database ( W3 ) and database |
| C86-1091 | multiplied . Morphonologic rules have | exact matching | conditions , therefore classification |
| D08-1040 | state - ment , the system uses | exact matching | searches of the whole phrases |
| C94-2114 | the candidate and the example ( | exact matching | ) . Word-sense ambiguities are |
| C00-1024 | function of tile thesauri . It uses | exact matching | . Tile precision is a little |
| C94-2114 | value is smaller than that for | exact matching | is given to the examples . The |
| C92-2104 | matching ( 2 ) Non-restricted | exact matching | ( 3 ) Restricted best latching |
| C92-2104 | methods are : ( 1 ) Restricted | exact matching | ( 2 ) Non-restricted exact matching |
| C92-2104 | Non-restricted best matching Restricted | exact matching | is a well-known method . This |
| C92-2104 | Second Step : ( l ) Rostricted | exact matching | Let WORK be an empty database |
| D11-1144 | presented above is obtained using an | exact matching | criterion where partial extraction |
| C94-2183 | , ed a ( :( : , . ~ l'ding to | exact matching | , matching of { h { " il ' parts |
| D13-1056 | P ) , recall ( R ) , F1 , and | exact matching | 6a few examples : two Atlanta-based |
| C96-1095 | workload by not considering the | exact matching | bracket pairs ; they are simply |
