lookup造句
1. Acceptable word candidates remaining after lexical look-up are stored for further analysis.
2. There will also be cases when a stray candidate from the lexical look-up is rejected by the later stages of analysis.
3. The major problems for the recognition application are the multitude of possible syntactic representations postulated by the look-up and the computation required.
4. Lexical lookup is more demanding of storage and processing but is better at rejecting unacceptable letter strings.
5. It is apparently done in quite a crude fashion, using a look-up table.
6. Much is made in the introductory sections of the look-up tables which cross-reference information and provide the route maps to solving problems.
7. The lexical look-up technique is preferable to statistical methods since it does not have a built-in error rate and guarantees lexical output.
8. Dictionary look-up methods give impressive error correction but require much greater storage and computation.
9. Dictionary look-up techniques represent the top-down approach, and involve verifying the input word by matching it with a dictionary word.
10. The population of the lookup table was done manually.
10.try its best to gather and create good sentences.
11. Lookup table mapping item store IDs to names.
12. The forward lookup zone cannot be added to the server.
13. This allows the entire lookup table to be loaded into memory each time a user submits a request to read or write data.
14. Dictionary lookup contests for 2 nd grade and above start today.
15. The wizard helps you create a secondary forward lookup zone.
16. Global Address List lookup – helping users to auto-complete a recipient's email address based on a list retrieved from a server.
17. When doing the lookup, the ResourceBundle class takes care of finding the correct resources for the system language code.
18. For more information on creating a reverse lookup zone, click Help.
19. This lookup is unambiguous because OSGi applications are isolated and Blether defines only a single persistence unit.
20. Traditional library card catalogs provide lookup by three attributes: author, subject, and title.
21. Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
22. Note the commented out code for JOnAS which uses the global JNDI name for lookup.
23. If you are not using DNS for Windows name resolution, you can use the nmblookup command to perform a NetBIOS name lookup.
24. The wizard will help you create a primary forward lookup zone.
25. If new standards exist, data should be mapped to those new standards through mapping values, against a lookup table, or based on a defined pattern or algorithm.
26. This paper introduces a method for high speed multicast routing lookup.
27. Code that refers to intVal will use the integer value 42 directly, and accesses to strVal will use a relatively inexpensive "string constant" instruction instead of a field lookup.
28. In this case, the mediation would parse the incoming message and perform a lookup of the right service provider based on differentiating content of the message.
29. Often, in order to build fast functions in C programming, you simply create a lookup table of all of the answers.
30. Invalid server data type ( % d ) specified in repl type lookup.
1234