字符串的模式匹配独立于符号(Pattern matching for strings independent from symbols)

 我需要一种算法，它可以在数据中找到预定义的模式（以字符串的形式出现），与数据和模式的实际符号/字符无关。 我只关心符号之间的关系，而不是符号本身。 在数据中为同一符号设置不同的模式符号也是合法的。 模式匹配算法必须强制执行的唯一事情是保留模式中相同符号的多个出现。 举个例子： 
 
 模式是abca ，因此第一个和最后一个字母是相同的。 对于我的应用程序，写这个的等效方法是1 2 3 1 ，其中数字只是变量。 我拥有的数据是最好的 。 结果算法应该给我两个正确的匹配， 文本和测试 。 因为只有在这两种情况下，第一个和第四个字母是相同的，就像在模式中一样。 
 
 作为第二个例子，模式abcd应该返回12个匹配（在thistextisat中每个位置一个）。 由于模式中没有变量重复，因此它无处不在。 即使在文本和测试的情况下，因为模式的变量a和d映射到相同的符号是合法的。 
 
 该算法的目标应该是检测书面语言的相似之处。 想象一下，有一本英语词典，并用看不见或等效的模式解析它1 2 3 4 4 2 。 然后你会看到，例如， belittle这个词包含相同的字母模式。 
 
 所以，既然我希望明确我需要什么，我有一些问题： 
 
 
 
 这个算法叫什么？ 这是一个已经解决的众所周知的问题吗？ 
 
 
 有关于此事的出版物吗？ 当你不知道正确的搜索术语来将这个问题与常规模式匹配分开时，很难找到任何有用的东西。 
 
 
 有没有现成的实现？ 
 
 
 我没有使用Regex来处理任何太复杂的事情，所以我不知道在Regex中是否有这样的东西甚至是可能的，当你基本上不关心这些符号时，只考虑它们出现的模式。 
 
 我真的很感谢你的帮助！ 

I have need for an algorithm which can find pre-defined patterns in data (which is present in the form of strings) independent from the actual symbols/characters of the data and the pattern. I only care about the relations between the symbols, not the symbols themselves. It is also legal to have different pattern symbols for the same symbol in the data. The only thing the pattern matching algorithm has to enforce is that multiple occurences of the same symbol in the pattern are preserved. To give you an example:
 
The pattern is abca, so the first and the last letter are the same. For my application, an equivalent way to write this would be 1 2 3 1, where the digits are just variables. The data I have is thistextisatest. The resulting algorithm should give me two correct matches here, text and test. Because only in these two cases, the first and the fourth letter are the same, as in the pattern.
 
As a second example, the pattern abcd should return 12 matches (one for each position in thistextisat). Since no variable in the pattern is repeated, it is trivially matched everywhere. Even in the case of text and test, because it is legal that the variables a and d of the pattern map to the same symbol.
 
The goal of this algorithm should be to detect similarities in written language. Imagine having a dictionary of the English language and parsing it with the pattern unseen or equivalently 1 2 3 4 4 2. You would then see that, for example, the word belittle contains the same pattern of letters.
 
So, now that I hopefully made clear what I need, I have some questions:
 
 
 
What is this algorithm called? Is it a well-known problem that has been solved?
 
 
Are there publications on the matter? It is really hard to find anything useful when you don't know the correct search terms to separate this problem from regular pattern matching.
 
 
Is there a ready implementation of this?
 
 
I have not used Regex for anything too complicated, so I don't know if anything like this would even be possible in Regex, when you basically do not care about the symbols as such, but only consider the pattern of their occurences.
 
I'd really appreciate your help!

原文：https://stackoverflow.com/questions/29393638