Hi all!
I am doing string matching with big amount of data.
EDIT: I am matching words contained in a big list with some ontology text files. I take each file from ontology, and search for a match between the third String of each file line and any word from the list.
I made a mistake in overseeing the fact that what I need to do is not pure matching (results are poor), but I need some looser matching function that will also return results when the string is contained inside another string.
I did this with a Radix Trie; it was very fast and works nice, but now I guess my work is useless because a trie returns only exact matches. :/
- Type of algorithms that do this are string searching algorithms?
- Can somebody suggest some Java implementations that he has experience with?
The algorithm should be fast, but is not top top priority, would compomise with speed & complexity.
I am very grateful for all advice/examples/explanations/links!
Thank you!