【发布时间】:2015-07-05 11:08:59
【问题描述】:
我有一个结构:
{
"content": "Name 1",
"name": "directory",
"decendent": [
{
"content": "Name 2",
"name": "subdirectory",
"decendent": None
},
{
"content": "Name 3",
"name": "subdirectory_two",
"decendent": [
{
"content": "Name 4",
"name": "subsubdirectory",
"decendent": None
}
]
}
]
}
我必须查找在搜索字段中输入的单词序列:
<form id="tfnewsearch" method="get" action="/help/search">
<input type="text" class="tftextinput" name="q" size="21" maxlength="120">
<input type="submit" value="Search" class="tfbutton">
</form>
如果我找到了 - 将它们添加到
[
{
"content": "The sought content",
"phrase": "the sought phrase",
"name": "unique name"
}, ...
]
对于每个发现的巧合。
例如: 如果我寻找“我有”,我应该得到:
[
{
"content": "I have a good day",
"phrase": "I have",
"name": "subdirectory",
},
{
"content": "While I have several ways to do it",
"phrase": "I have",
"name": "subdirectory2"
},
{
"content": "When I had it",
"phrase": "I have",
"name": "subdirectory3"
},
]
如果我要在搜索过程中使用 pymorhph2 之类的形态分析器(例如:“have”、“had”)更改此短语,如何使用递归在 Python 中实现它?
提前致谢!
【问题讨论】:
-
我已将其添加到说明中
-
已修复。你可以再读一遍。
标签: python django algorithm search recursion