Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
sfewfsaf
Synonyms
提交
fe7450d5
S
Synonyms
项目概览
sfewfsaf
/
Synonyms
与 Fork 源项目一致
从无法访问的项目Fork
通知
6
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
S
Synonyms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
fe7450d5
编写于
4月 21, 2019
作者:
Chatopera 研发团队
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Closed #77 fix package version for better compatibility
上级
b23e1c3b
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
17 addition
and
8 deletion
+17
-8
demo.py
demo.py
+7
-0
setup.py
setup.py
+4
-4
synonyms/synonyms.py
synonyms/synonyms.py
+6
-4
未找到文件。
demo.py
浏览文件 @
fe7450d5
...
...
@@ -137,6 +137,13 @@ class Test(unittest.TestCase):
def
test_badcase_1
(
self
):
synonyms
.
display
(
"人脸"
)
# synonyms.display calls synonyms.nearby
def
test_basecase_2
(
self
):
print
(
"test_basecase_2"
)
sen1
=
"今天天气"
sen2
=
"今天天气怎么样"
r
=
synonyms
.
compare
(
sen1
,
sen2
,
seg
=
True
)
def
test
():
unittest
.
main
()
...
...
setup.py
浏览文件 @
fe7450d5
...
...
@@ -13,7 +13,7 @@ Welcome
setup
(
name
=
'synonyms'
,
version
=
'3.10.
0
'
,
version
=
'3.10.
2
'
,
description
=
'Chinese Synonyms for Natural Language Processing and Understanding'
,
long_description
=
LONGDOC
,
author
=
'Hai Liang Wang, Hu Ying Xi'
,
...
...
@@ -40,9 +40,9 @@ setup(
install_requires
=
[
'six>=1.11.0'
,
'numpy>=1.13.1'
,
'scipy
=
=1.0.0'
,
'scikit-learn
=
=0.19.1'
,
'absl-py
==0.1.10
'
'scipy
>
=1.0.0'
,
'scikit-learn
>
=0.19.1'
,
'absl-py
>=0.4
'
],
package_data
=
{
'synonyms'
:
[
...
...
synonyms/synonyms.py
浏览文件 @
fe7450d5
...
...
@@ -247,8 +247,10 @@ def _nearby_levenshtein_distance(s1, s2):
scores
=
[]
for
x
in
second
:
scores
.
append
(
max
([
_levenshtein_distance
(
x
,
y
)
for
y
in
ft
]))
s
=
np
.
sum
(
scores
)
/
maxlen
choices
=
[
_levenshtein_distance
(
x
,
y
)
for
y
in
ft
]
if
len
(
choices
)
>
0
:
scores
.
append
(
max
(
choices
))
s
=
np
.
sum
(
scores
)
/
maxlen
if
len
(
scores
)
>
0
else
0
return
s
def
_similarity_distance
(
s1
,
s2
,
ignore
):
...
...
@@ -319,8 +321,8 @@ def compare(s1, s2, seg=True, ignore=False, stopwords=False):
s2_words
=
[]
if
seg
:
s1
=
[
x
for
x
in
jieba
.
cut
(
s1
)]
s2
=
[
x
for
x
in
jieba
.
cut
(
s2
)]
s1
=
[
x
for
x
in
jieba
.
cut
(
s1
,
cut_all
=
False
,
HMM
=
False
)]
s2
=
[
x
for
x
in
jieba
.
cut
(
s2
,
cut_all
=
False
,
HMM
=
False
)]
else
:
s1
=
s1
.
split
()
s2
=
s2
.
split
()
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录