Research on Wildcard Character of Appoximate Matching in Manufacturing Engineering

Abstract:

The paper first analysiss the types and methods of the wildcard characters, then discuss the matching in manufacturing engineering problems which it exists in the pattern matching. According to the problems, it puts forward algorithm to realize approximate matching. At last, it provides the flow charts and examples of the algorithm. From the example of experimental result, exact machining can be realized approximate matching through the wildcard characters. So various matching algorithm can be extended and used more.

• Periodical: Applied Mechanics and Materials (Volume 312)
• Pages: 502-505
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.312.502
• Online since: February 2013
• Authors: Xi Hong Wu
• Keywords: Approximate Matching, Manufacturing Engineering, Pattern Matching, Wildcard Character

References

[1] Knuth, Morris (1977) Fast Pattern Matching In Strings. SIAM Computer 1(2):323-328

[2] Boyer RS (1977) Moore JS.A Fast String Searching Algorithm. Communications of the ACM 2(10):762-772

DOI: 10.1145/359842.359859

[3] Aho A V, Cora sick M J (1975) Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 3(6):333-340

DOI: 10.1145/360825.360855

[4] Ao Jing ping (2009) How to Settle the String Comparison Containing Wildcard Character. Computer Programming Skills & Maintenance 4(5):90-94

[5] Miao Lan fang, Yang Chuan bin (1996) Fuzzy Character String Matching Algorithm and Its Application. Mini-Micro Systems 5(17)10:72-76